/*
 * @Date: 2021-09-10 09:44:05
 * @Author: Acckno1
 * @LastEditTime: 2021-09-10 09:44:11
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 110;

int n;
int num[N];

inline void solution() {
    cin >> n;
    for (int i = 1; i <= n; i ++ ) cin >> num[i];
    
    for (int i = 1; i <= n; i ++ ) {
        for (int j = i + 1; j <= n; j ++ ) {
            int a = 0, b = 0;
            for (int k = 1; k <= n; k ++ ) {
                // 假话
                if ((abs(num[k]) == i || abs(num[k]) == j) ^ num[k] < 0) {
                    a ++ ;
                    if (k == i || k == j) b ++ ;
                }
            }
            if (a == 2 && b == 1) {
                cout << i << " " << j << endl;
                return 0;
            }
        }
    }
    cout << "No Solution" << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}